On alternating ω-automata
نویسندگان
چکیده
منابع مشابه
On the Generative Power of ω-Grammars and ω-Automata
An ω-grammar is a formal grammar used to generateω-words (i.e. infinite length words), while an ω-automaton is an automaton used to recognize ω-words. This paper gives clean and uniform definitions for ω-grammars and ω-automata, provides a systematic study of the generative power of ω-grammars with respect to ω-automata, and presents a complete set of results for various types of ω-grammars and...
متن کاملBlind Counter Automata on ω-Words
This paper generalizes the concept of blind multicounter languages to infinite words. We introduce two different acceptance modes of blind multicounter machines on ω-words, called synchrononous and asynchronous acceptance. These acceptance modes are compared with each other and with families of ω-languages of the form L = ⋃ 1≤i≤k UiV ω i , where Ui, Vi are finitary blind multicounter languages.
متن کاملAlternating and Empty Alternating Auxiliary Stack Automata
We consider variants of alternating auxiliary stack automata and characterize their computational power when the number of alternations is bounded by a constant or unlimited. In this way we get new characterizations of NP, the polynomial hierarchy, PSpace, and bounded query classes like co-DP=NL〈NP[1]〉 and 2P=P , in a uniform framework. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملOn MITL and Alternating Timed Automata
One clock alternating timed automata (OCATA) have been recently introducedas natural extension of (one clock) timed automata to express the semantics ofMTL [11]. We consider the application of OCATA to problem of model-checkingMITL formulas (a syntactic fragment of MTL) against timed automata. We intro-duce a new semantics for OCATA where, intuitively, clock valuations are i...
متن کاملDeterminization Complexities of ω Automata
Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature. In the case of nondeterministic finite automata on finite words (NFA), complementation and determinization have the same state complexity, namely Θ(2) where n is the state size. The same similarity between determinization and comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1988
ISSN: 0022-0000
DOI: 10.1016/0022-0000(88)90018-9